A Distributed Memory Unstru tured Gauss-Seidel Algorithm for Multigrid Smoothers
نویسنده
چکیده
منابع مشابه
Parallel Multigrid Smoothing: Polynomial versus Gauss-seidel
Gauss-Seidel method is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for po...
متن کاملAlgebraic Tailoring of Discontinuous Galerkin p-Multigrid for Convection
This work presents an element-local algebraic approach to constructing coarse spaces for p-multigrid solvers and preconditioners of high-order discontinuous Galerkin discretizations. The target class of problems is convective systems on unstructured meshes, a class for which traditional p-multigrid typically fails to reach textbook multigrid efficiency due to a mismatch between smoothers and co...
متن کاملCombining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling
Finite Element problems are often solved using multigrid techniques. The most time consuming part of multigrid is the iterative smoother, such as Gauss-Seidel. To improve performance, iterative smoothers can exploit parallelism, intra-iteration data reuse, and inter-iteration data reuse. Current methods for parallelizing Gauss-Seidel on irregular grids, such as multi-coloring and ownercomputes ...
متن کاملThe Analysis of Smoothers for Multigrid Algorithms
The purpose of this paper is to provide a general technique for defining and analyzing smoothing operators for use in multigrid algorithms. The smoothing operators considered are based on subspace decomposition and include point, line, and block versions of Jacobi and Gauss-Seidel iteration as well as generalizations. We shall show that these smoothers will be effective in multigrid algorithms ...
متن کاملMultigrid Smoothers for Ultra-parallel Computing: Additional Theory and Discussion
This paper investigates the properties of smoothers in the context of algebraic multigrid (AMG) running on parallel computers with potentially millions of processors. The development of multigrid smoothers in this case is challenging, because some of the best relaxation schemes, such as the Gauss-Seidel (GS) algorithm, are inherently sequential. Based on the sharp two-grid multigrid theory from...
متن کامل